Learning Relations by Pathfinding

نویسندگان

  • Bradley L. Richards
  • Raymond J. Mooney
چکیده

First-order learning systems (e.g., FOIL, FOCL, FORTE) generally rely on hill-climbing heuristics in order to avoid the combinatorial explosion inherent in learning first-order concepts. However, hill-climbing leaves these systems vulnerable to local maxima and local plateaus. We present a method, called relational pathfinding, which has proven highly effective in escaping local maxima and crossing local plateaus. We present our algorithm and provide learning results in two domains: family relationships and qualitative model building.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Relations by Bathfinding

First-order learning systems (e.g., FOlL, FOCL, FORTE) generally rely on hill-climbing heuristics in order to avoid the combinatorial explosion inherent in learning first-order concepts. However, hill-climbing leaves these systems vulnerable to local maxima and local plateaus. We present a method, called relational pathfinding, which has proven highly effective in escaping local maxima and cros...

متن کامل

Realistic Agent Movement in Dynamic Game Environments

One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core of any AI movement system. This paper examines pathfinding algorithms used presently in games and details their shortcomings. These shortcomings are particularly apparent when pathfinding must be carried out in real-t...

متن کامل

Pathfinding in Computer Games

One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core of any AI movement system. This report will highlight pathfinding algorithms used presently in games and their shortcomings especially when dealing with real-time pathfinding. With the advances being made in other com...

متن کامل

Proposed Optimal Growth Pathfinding Method Based on Growth Trajectories

In this study, the authors propose an optimal growth pathfinding method to support learners in effectively mastering a set of capabilities. Under the assumption of prerequisite relationships among learning objectives, the main processes of the method are as follows: (1) extracting the capability structure from growth trajectories, (2) remodeling the problem as a traveling salesman problem with ...

متن کامل

Neural Networks for Real-time Pathfinding in Computer Games

One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core of any AI movement system. The two main components for basic real-time pathfinding are (i) travelling towards a specified goal and (ii) avoiding dynamic and static obstacles that may litter the path to this goal. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992